Analysis of Deadline Scheduled Real-Time Systems
نویسنده
چکیده
A uniform, exible approach is proposed for analysing the feasibility of deadline scheduled real-time systems. In its most general formulation, the analysis assumes sporadically periodic tasks with arbitrary deadlines, release jitter, and shared resources. System overheads of a tick driven scheduler implementation, and scheduling of soft aperiodic tasks are also accounted for. A procedure for the computation of task worst-case response times is also described for the same model. While this problem has been largely studied in the context of xed priority systems, we are not aware of other works that have proposed a solution to it when deadline scheduling is assumed. The worst-case response time evaluation is a fundamental tool for analysing end-to-end timing constraints in distributed systems [21]. Key-words: real-time, scheduling, feasibility analysis, response times.
منابع مشابه
Global DM schedulability analysis: upper and lower bounds∗
A new technique was recently introduced [7] for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by the global Deadline-Monotonic (DM) scheduling algorithm. It is sho...
متن کاملA Model for Buffer Exploration in EDF Scheduled Embedded Systems
The present paper describes an extension to real-time analysis of earliest-deadline first (EDF) scheduled embedded systems to allow design space exploration with different intertask communication. The event stream approach for real-time analysis is generalized to unbuffered task communication. Adding this analysis technique to a well known cost model for system level synthesis, it becomes possi...
متن کاملHolistic Analysis for Deadline Scheduled Real-Time Distributed Systems
The holistic theory is a very interesting approach formerly proposed by Tindell and Clark [23] for assessing the feasibility of xed priority real-time systems. Its major merit is to make the analysis of distributed systems tractable, without being at the same time too pessimistic. In this paper we extend the holistic theory to the analysis of deadline scheduled real-time distributed systems. Ow...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملSensitivity Analysis of Task Period for EDF Scheduled Arbitrary Deadline Real-Time Systems
The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is very useful in an engineering context to know what changes to period (interarrival time) can be made to a task that will deliver a schedulable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996